Computing the partition function for graph homomorphisms
نویسندگان
چکیده
منابع مشابه
Computing the partition function for graph homomorphisms
We introduce the partition function of edge-colored graph homomorphisms, of which the usual partition function of graph homomorphisms is a specialization, and present an efficient algorithm to approximate it in a certain domain. Corollaries include efficient algorithms for computing weighted sums approximating the number of k-colorings and the number of independent sets in a graph, as well as a...
متن کاملComputing the partition function for graph homomorphisms with multiplicities
We consider a refinement of the partition function of graph homomorphisms and present a quasi-polynomial algorithm to compute it in a certain domain. As a corollary, we obtain quasi-polynomial algorithms for computing partition functions for independent sets, perfect matchings, Hamiltonian cycles and dense subgraphs in graphs as well as for graph colorings. This allows us to tell apart in quasi...
متن کاملComputing the Partition Function for Cliques in a Graph
We present a deterministic algorithm which, given a graph G with n vertices and an integer 1 < m ≤ n, computes in nO(lnm) time the sum of weights w(S) over all msubsets S of the set of vertices of G, where w(S) = exp{γmσ(S)+O(1/m)} provided exactly (m 2 ) σ(S) pairs of vertices of S span an edge of G for some 0 ≤ σ(S) ≤ 1, and γ > 0 is an absolute constant. This allows us to tell apart the grap...
متن کاملComputing the integer partition function
In this paper we discuss efficient algorithms for computing the values of the partition function and implement these algorithms in order to conduct a numerical study of some conjectures related to the partition function. We present the distribution of p(N) for N ≤ 109 for primes up to 103 and small powers of 2 and 3.
متن کاملCounting Homomorphisms and Partition Functions
Homomorphisms between relational structures are not only fundamental mathematical objects, but are also of great importance in an applied computational context. Indeed, constraint satisfaction problems, a wide class of algorithmic problems that occur in many different areas of computer science such as artificial intelligence or database theory, may be viewed as asking for homomorphisms between ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Combinatorica
سال: 2016
ISSN: 0209-9683,1439-6912
DOI: 10.1007/s00493-016-3357-2